NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
301	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-10-02 11:19:31 NP-complete problems Graph Graph theory Matching Cycle Hamiltonian path Spanning tree
302	Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages Maciej Besta Torsten Hoefler Add to Reading List Source URL: htor.inf.ethz.ch Language: English - Date: 2015-09-14 07:27:20 Graph theory Mathematics Computing Concurrency control Transaction processing NP-complete problems Computer memory Transactional memory Vertex Breadth-first search Graph coloring Transactional Synchronization Extensions
303	Decision-aid Methodology for the School Bus Routing and Scheduling Problem Michela Spada, ROSO-IMA-EPFL Michel Bierlaire, ROSO-IMA-EPFL Thomas Liebling, ROSO-IMA-EPFL Add to Reading List Source URL: www.strc.ch Language: English - Date: 2009-01-15 17:07:11 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Travelling salesman problem Integer programming School bus Branch and bound Bus Heuristic Lagrangian relaxation
304	Local Properties of Geometric Graphs Jean Cardinal∗ S´ebastien Collette† Stefan Langerman‡ § relation between any pair of sites and the number of items in its neighborhood. Add to Reading List Source URL: www.ulb.ac.be Language: English - Date: 2011-02-08 09:21:41 Graph theory Bipartite graphs Geometric spanner Shortest path problem Planar graph Tree Delaunay triangulation NP-complete problems Planar separator theorem Trapezoid graph
305	The Vehicle Routing Problem with Discrete Split Delivery and Time Windows Ilaria Vacca Matteo Salani STRC 2009 Add to Reading List Source URL: www.strc.ch Language: English - Date: 2009-09-16 14:54:48 Operations research Mathematical optimization Numerical analysis Mathematics NP-complete problems Vehicle routing problem Dynamic programming Column generation Optimization problem XTR DantzigWolfe decomposition
306	Fine-Grained Complexity and Algorithm Design Boot Camp Recent Advances in FPT and Exact Algorithms for NP-Complete Problems Dániel Marx Institute for Computer Science and Control, Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2015-09-01 20:36:26
307	Almost partitioning any 3-edge-coloured Kn,n into 5 monochromatic cycles Richard Lang, Oliver Schaudt, Maya Stein∗ 30th SeptemberAbstract Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-09-30 15:39:15 NP-complete problems Combinatorial optimization Graph coloring Matching Cycle Bipartite graph Graph
308	WeilSchaudt_DeltaChi_GaC.dvi Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-06-05 05:09:32 Graph theory Graph coloring NP-complete problems Graph operations Perfect graph theorem Line graph Perfect graph Clique Bipartite graph Triangle-free graph Strong perfect graph theorem Graph minor
309	How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley Add to Reading List Source URL: www2013.wwwconference.org Language: English - Date: 2014-07-21 08:47:06 Mathematics NP-complete problems Combinatorics Discrete mathematics Greedy algorithm Matroid theory Set cover problem Algorithm Combinatorial optimization
310	Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University Add to Reading List Source URL: www.cs.ucsb.edu Language: English - Date: 2013-03-23 01:40:10 Graph theory NP-complete problems Graph coloring Graph Global Positioning System Random graph

UPDATE